Random Matrix Theory-Based Reduced-Dimension Space-Time Adaptive Processing under Finite Training Samples

High Dimension Space Time Adaptive Processing Based on FFT

One of the advantages of the joint space time adaptive processing technique is that the freedom degree can be increased greatly without adding any antenna elements, which can improve the ability of the anti-jamming array to reject the narrow band jamming. But the disadvantage is that the computation will be more and more complex with the processing dimension being higher and higher. In this pap...

Reduced dimension space-time processing for multi-antenna wireless systems

The need for wireless communication systems has grown rapidly during the last few years. Moreover, there is a steady growth in the required data rates due to the fact that more and more users request high-bit-rate services. To meet those requirements, current and next-generation wireless systems and networks such as wireless LANs (e.g., IEEE 802.11a) will support much higher data rates compared...

Space-time adaptive processing

18 . 325 : Finite Random Matrix Theory

In this section, we concern ourselves with the differentiation of matrices. Differentiating matrix and vector functions is not significantly harder than differentiating scalar functions except that we need notation to keep track of the variables. We titled this section “matrix and vector” differentiation, but of course it is the function that we differentiate. The matrix or vector is just a not...

Random Matrix Theory over Finite Fields

The first part of this paper surveys generating functions methods in the study of random matrices over finite fields, explaining how they arose from theoretical need. Then we describe a probabilistic picture of conjugacy classes of the finite classical groups. Connections are made with symmetric function theory, Markov chains, Rogers-Ramanujan type identities, potential theory, and various meas...